Lower Estimate of Clique Size via Edge Coloring
نویسندگان
چکیده
منابع مشابه
Improved Lower Bounds for Sum Coloring via Clique Decomposition
Given an undirected graph G = (V,E) with a set V of vertices and a set E of edges, the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of G, using colors represented by natural numbers 1, 2, ... such that the total sum of the colors assigned to the vertices is minimized. This paper describes an approach based on the decomposition of the original graph into disjoint clique...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملSwitch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output ports as the two vertex sets. Packets arriving at input port i and destined for output port j can be modeled as an edge from i to j. Current switch scheduling algorithms view the routing of packets at each time step as a s...
متن کاملFrom Edge-Coloring to Strong Edge-Coloring
In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: k-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian [18]. In this coloring, the set S(v) of colors used by edges incident to a vertex v does not intersect S(u) on more than k colors when u and v are adjacent. We provide some sharp upper and lower bounds for χk-int for several ...
متن کاملExtended Formulation Lower Bounds via Hypergraph Coloring?
Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions concern whether there are compact formulations even for problems that are known to admit polynomial-time algorithms. We propose a framework for proving lower bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Pannonica
سال: 2021
ISSN: 0865-2090,2786-0752
DOI: 10.1556/314.2020.00002